On the average shape of monotonically labelled tree structures
نویسندگان
چکیده
منابع مشابه
Monotonically labelled Motzkin trees
Consider a rooted tree structure the nodes of which have been labelled monotonically by elements of { 1, 2, . . .,k}, which means that any sequence connecting the root of the tree with a leaf is weakly monotone . For fixed k asymptotic equivalents of the form CA gA °n; 2 (n --oo) to the numbers of such tree structures with n nodes are obtained for the family of extended unary-binary trees (i .e...
متن کاملOn Heights of Monotonically Labelled Binary Trees
A monotonically labelled binary tree is a binary tree with integer labels attached to the internal nodes in such a way that the labels along any path from the root are nondecreasing. If there is only one label, we are dealing with ordinary binary trees. Prodinger and Urbanek [6] introduced a variety of families of monotonically labelled trees and obtained enumerative results about many of them....
متن کاملthe role of task-based techniques on the acquisition of english language structures by the intermediate efl students
this study examines the effetivenss of task-based activities in helping students learn english language structures for a better communication. initially, a michigan test was administered to the two groups of 52 students majoring in english at the allameh ghotb -e- ravandi university to ensure their homogeneity. the students scores on the grammar part of this test were also regarded as their pre...
15 صفحه اولthe effect of consciousness-raising activities on learning grammatical structures by iranian guidance school efl learners
abstract the first purpose of this study was to investigate the effect of consciousness-raising (c-r) activities on learning grammatical structures (simple present tense in this case) by iranian guidance school efl learners. the second one was to investigate the effect of gender on learning the simple present tense through c-r activities and tasks. finally, this study aimed to investigate the ...
Some results for monotonically labelled simply generated trees
We consider simply generated trees, where the nodes are equipped with weakly monotone labellings with elements of {1,2, . . . ,r}, for r fixed. These tree families were introduced in Prodinger and Urbanek (1983) and studied further in Kirschenhofer (1984), Blieberger (1987), and Morris and Prodinger (2005). Here we give distributional results for several tree statistics (the depth of a random n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1984
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90064-7